package easy;

import java.util.Arrays;

/**
 * Created by daodao on 2018/7/16.
 * Problem 88
 * Description: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
 *
 * Note: The number of elements initialized in nums1 and nums2 are m and n respectively.
 * You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
 *
 * Example: Input: nums1 = [1,2,3,0,0,0], m = 3
 *                 nums2 = [2,5,6],       n = 3
 *          Output: [1,2,2,3,5,6]
 */
public class MergeSortedArray {
    public static void merge(int[] nums1, int m, int[] nums2, int n) {
        if (nums2.length == 0) {
            return;
        }
        int[] nums = new int[nums1.length];
        int i = 0, j = 0, k = 0;
        for (;i < m && j < n;) {
            nums[k++] = nums2[j] < nums1[i] ? nums2[j++] : nums1[i++];
        }
        while (i < m) {
            nums[k++] = nums1[i++];
        }
        while (j < n) {
            nums[k++] = nums2[j++];
        }
        for (i = 0; i < k; i++) {
            nums1[i] = nums[i];
        }
    }
}
